Search | Engineering

Subscribe Submit

Home Journals Focus Achievement Fronts About Us 中文版

Resource Type

Journal Article 438

Conference Videos 1

Year

2023 21

2022 30

2021 35

2020 26

2019 26

2018 15

2017 29

2016 21

2015 21

2014 28

2013 15

2012 15

2011 7

2010 12

2009 16

2008 21

2007 25

2006 24

2005 11

2004 8

open ︾

Keywords

genetic algorithm 33

algorithm 14

optimization 14

Genetic algorithm 4

neural network 4

artificial neural network 3

meta-heuristic algorithm 3

Algorithm 2

Anomaly detection 2

BP algorithm 2

BP neural network 2

CDMA 2

China 2

Clustering 2

FEM 2

HY-2 2

Machine learning 2

Reinforcement learning 2

Support vector machine (SVM) 2

open ︾

Search scope:

排序： Display mode:

Dynamical Fast IP-Routing Lookup Algorithm

Liu Yalin

Strategic Study of CAE 2002, Volume 4, Issue 7, Pages 60-68

Abstract:

This paper proposes a dynamical fast IP-routing lookup algorithm (DFR).This algorithm uses special data structure to construct index table, and can support inserting, deletingDFR algorithm accesses memory at most four times and at least two times for a route look up.DFR is suitable not only for hardware implementation but also for software implementation.

Keywords： prefix expansion dynamical fast IP-routing lookup algorithm (DFR) route route lookup

HTML PDF Collect

Group-based multiple pipe routing method for aero-engine focusing on parallel layout

Frontiers of Mechanical Engineering 2021, Volume 16, Issue 4, Pages 798-813 doi: 10.1007/s11465-021-0645-3

Abstract: External pipe routing for aero-engine in limited three-dimensional space is a typical nondeterministicThis paper presents an automatic multiple pipe routing method for aero-engine that focuses on parallelThe compressed visibility graph construction algorithm is proposed first to determine rapidly the roughSubsequently, a coevolutionary improved differential evolution algorithm, which adopts the coevolutionaryBy using this algorithm, pipes in the same group share the layout space information with one another,

Keywords： multiple pipe routing optimization algorithm aero-engine pipe grouping parallel layout

HTML PDF Collect

Research and Realization of IP Multicast Routing Protocol

Li Wei

Strategic Study of CAE 2002, Volume 4, Issue 1, Pages 82-88

Abstract:

This paper first explains why IP multicasting must be used.Then it summaries the fundamentals of IP multicasting and multicast routing protocols.Finally it discusses the problems and prospect of IP multicasting.

Keywords： protocol independent multicast-sparse mode (PIM-SM) multiple rendezvous point (RPs) multicast

HTML PDF Collect

Application Research on Vehicle Routing Problem With Time Windows Based on Dynamic Ant Algorithm

Liu Yunzhong,Xuan Huiyu

Strategic Study of CAE 2005, Volume 7, Issue 12, Pages 35-40

Abstract:

Ant algorithm is a newly emerged stochastic searching optimization algorithm in recent years.This paper further extends the idea of this new biological optimization strategy to vehicle routing problemwith time windows in logistic management and designs a new kind of dynamic ant algorithm.The ability of optimization of this new ant algorithm is tested through numerical computation which gives

Keywords： ant algorithm vehicle routing problem with time windows logistic management dynamic

HTML PDF Collect

Branch-pipe-routing approach for ships using improved genetic algorithm

Haiteng SUI,Wentie NIU

Frontiers of Mechanical Engineering 2016, Volume 11, Issue 3, Pages 316-323 doi: 10.1007/s11465-016-0384-z

Abstract:

Branch-pipe routing plays fundamental and critical roles in ship-pipe design.The branch-pipe-routing problem is a complex combinatorial optimization problem and is thus difficultA modified genetic-algorithm-based approach is proposed in this paper to solve this problem.two-point pipes, and the pipe route between two connection points is generated using an improved maze algorithm

Keywords： branch pipe ship industry piping system optimization algorithm

HTML PDF Collect

Design of 8-bit MCU IP Core

Li Xiujuan,Wang Zuqiang,Liu Xianwei

Strategic Study of CAE 2006, Volume 8, Issue 12, Pages 89-91

Abstract:

According to the top-down design method, a MCU IP core has been designed.

Keywords： MCU IP data path

HTML PDF Collect

Fast detection algorithm for cracks on tunnel linings based on deep semantic segmentation

Frontiers of Structural and Civil Engineering 2023, Volume 17, Issue 5, Pages 732-744 doi: 10.1007/s11709-023-0965-y

Abstract: An algorithm based on deep semantic segmentation called LC-DeepLab is proposed for detecting the trendsThe novel algorithm is based on the DeepLabv3+ network framework., and DeepLabv3+) are selected for comparative analysis to verify the effectiveness of the proposed algorithm

Keywords： tunnel engineering crack segmentation fast detection DeepLabv3+ feature fusion attention mechanism

HTML PDF Collect

A fast compound direct iterative algorithm for solving transient line contact elastohydrodynamic lubrication

Jian LIU,Yuxue CHEN,Zhenzhi HE,Shunian YANG

Frontiers of Mechanical Engineering 2014, Volume 9, Issue 2, Pages 156-167 doi: 10.1007/s11465-014-0297-7

Abstract:

A fast compound direct iterative algorithm for solving transient line contact elastohydrodynamicThe results demonstrate that the new algorithm increases computing speed several times more than theAlso the results show that the new algorithm can get the best computing speed and robustness when the

Keywords： elastohydrodynamic lubrication transient line contact matrix splitting iteration method the Thomas method

HTML PDF Collect

Spatiotemporal distance embedded hybrid ant colony algorithm for a kind of vehicle routing problem with Research Article

Zhenhui FENG, Renbin XIAO,feng_zh@hust.edu.cn,rbxiao@hust.edu.cn

Frontiers of Information Technology & Electronic Engineering 2023, Volume 24, Issue 7, Pages 1062-1079 doi: 10.1631/FITEE.2200585

Abstract: It is a typical extended vehicle routing problem (VRP) with both time and space constraints.temporal and spatial properties of the customer, and a spatiotemporal distance embedded hybrid ant colony algorithmThe algorithm can be divided into two stages.Finally, we provide two actual urban scenarios to further verify the effectiveness of the proposed algorithm

Keywords： Vehicle routing problem with constraints (VRPC) Spatiotemporal distance function Labor division strategy Ant colony algorithm (ACO

HTML PDF Collect

Capacity of VoIP in IEEE 802.11 Wireless LAN

Chen Liquan,Hu Aiqun,Zhou Xueli

Strategic Study of CAE 2005, Volume 7, Issue 7, Pages 81-85

Abstract:

Voice transmitted over wireless LAN faces serious challenge because of the fluctuation of the wireless channel. In this paper, the transmission of voice over wireless LAN is firstly analyzed. Taking collision probability into account, the stochastic analysis based on a Markov chain to calculate the upper bound number of simultaneous VoIP calls that can be supported in a single cell of an IEEE 802. llb/a/g network is proposed. The upper bound capacities of G. 711, G. 729 and G. 723.1 code transmitted over 802. llb/a/g are figured out. The simulation results from NS2 simulator have validated the analysis values.

Keywords： wireless LAN voice over IP capacity Markov chain

HTML PDF Collect

Anovel forwarding and routing mechanism design in SDN-basedNDNarchitecture None

Jia LI, Ren-chao XIE, Tao HUANG, Li SUN

Frontiers of Information Technology & Electronic Engineering 2018, Volume 19, Issue 9, Pages 1135-1150 doi: 10.1631/FITEE.1700698

Abstract: SDN, we design a novel forwarding mechanism in NDN architecture with distributed controllers, where routingIn addition, we propose a novel routing algorithm considering quality of service (QoS) applied in thetake both resource consumption and network load balancing into consideration and introduce a genetic algorithm(GA) to solve the QoS constrained routing problem using global network information.Simulation results are presented to demonstrate the performance of the proposed routing scheme.

Keywords： SDN-based NDN Forwarding mechanism QoS routing Genetic algorithm

HTML PDF Collect

Traditional Chinese medicine: potential approaches from modern dynamical complexity theories

Yan Ma,Kehua Zhou,Jing Fan,Shuchen Sun

Frontiers of Medicine 2016, Volume 10, Issue 1, Pages 28-32 doi: 10.1007/s11684-016-0434-2

Abstract: TCM views the human body as a complex dynamical system, and focuses on the balance of the human body,Only methods that quantify dynamical complexity can bring new insights into the evaluation of TCM.article aims to explain the existing challenges in TCM quantification, to introduce the consistency of dynamical

Keywords： traditional Chinese medicine quantification dynamical complexity system level balance modern sciences

HTML PDF Collect

One Novel Dynamic Routing and Wavelength Assignment Integrate Algorithm in WDM Optical Network

Li Lei,Tang Yong,Rao Min,Chen Yu,Jiang Jianfeng,Zhang Mingde,Sun Xiaohan

Strategic Study of CAE 2004, Volume 6, Issue 12, Pages 73-77

Abstract:

Dynamic routing and wavelength assignment in the WDM networks with.both dynamic service traffic andAccording to probability and limitation of wavelength conversion, a novel heuristic algorithm, whichcould achieve dynamic minimum cost routing and optimal virtual wavelength path, DMC - OVWP, is proposedbased on Moone-Dijkstra algorithm.With separation and combination of routing and wavelength assignment subproblems, the algorithm optimizes

Keywords： dynamic routing DWC-OVWP wavelength conversion virtual wavelength path link weight

HTML PDF Collect

Practical optimization of deployable and scissor-like structures using a fast GA method

M. SALAR, M. R. GHASEMI, B. DIZANGIAN

Frontiers of Structural and Civil Engineering 2019, Volume 13, Issue 3, Pages 557-568 doi: 10.1007/s11709-018-0497-z

Abstract: Also, to do optimization task, a fast genetic algorithm method, which has been recently introduced by

Keywords： optimization scissor-like structures deployable structures genetic algorithm ABAQUS

HTML PDF Collect

Fast forward kinematics algorithm for real-time and high-precision control of the 3-RPS parallel mechanism

Yue WANG, Jingjun YU, Xu PEI

Frontiers of Mechanical Engineering 2018, Volume 13, Issue 3, Pages 368-375 doi: 10.1007/s11465-018-0519-5

Abstract:

A new forward kinematics algorithm for the mechanism of 3-RPS (R: Revolute; P: Prismatic; S: SphericalThis algorithm is primarily based on the special geometric conditions of the 3-RPS parallel mechanismThis algorithm substantially improves calculation efficiency because the selected initial values areThis novel forward kinematics algorithm is well suited for real-time and high-precision control of the

Keywords： 3-RPS parallel mechanism forward kinematics numerical algorithm parasitic motion